Generalization of LRU Cache Replacement Policy with Applications to Video Streaming

Cooperative cache framework for video streaming applications

The performance of streaming caches is not only affected by cache management but also determined by cache cooperation. If caches cooperate together, the desired video may be obtained from other caches thus reducing server load. However, such process increases network traffic between caches. It must be done carefully. This paper proposes a cooperative cache framework to automatically select appr...

LRU-based Algorithms for Web Cache Replacement

Caching has been introduced and applied in prototype and commercial Web-based information systems in order to reduce the overall bandwidth and increase system’s fault tolerance. This paper presents a track of Web cache replacement algorithms based on the Least Recently Used (LRU) idea. We propose an extension to the conventional LRU algorithm by considering the number of references to Web objec...

A Computationally Efficient P-LRU based Optimal Cache Heap Object Replacement Policy

The recent advancement in the field of distributed computing depicts a need of developing highly associative and less expensive cache memories for the state-of-art processors i.e., Intel Core i6, i7, etc. Hence, various conventional studies introduced cache replacement policies which are one of the prominent key factors to determine the effectiveness of a cache memory. Most of the conventional ...

Popularity-Aware Cache Replacement in Streaming Environments

A Cache - Partitioned Hash Table with LRU

In this thesis we introduce CPHASH a scalable fixed size hash table that supports eviction using an LRU list, and CPSERVER a scalable in memory key/value cache server that uses CPHASH to implement its hash table. CPHASH uses computation migration to avoid transferring data between cores. Experiments on a 48 core machine show that CPHASH has 2 to 3 times higher throughput than a hash table imple...